On-line Load Balancing
نویسنده
چکیده
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a diierent level of service, and once assigned can not be reassigned. We make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. In this paper we derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely (3n) 2=3 2 (1 + o(1)), and derive a lower bound, (n 1=2), for any other deterministic or randomized on-line algorithm.
منابع مشابه
Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملLoad Balancing Approaches for Web Servers: A Survey of Recent Trends
Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...
متن کاملDeterministic and Randomized Algorithms for Distributed On-line Task Assignment and Load Balancing without Load Status Information Deterministic and Randomized Algorithms for Distributed On-line Task Assignment and Load Balancing without Load Status Information
{ We nd two interesting thresholds for the number of tasks generated under a new model of on-line task assignment and load balancing environment, in which tasks are assigned without any information on current load status, and load balancing is achieved together with task assignment. It is shown that balanced task assignment can be obtained deterministically when the number of tasks exceeds the ...
متن کاملCost-Effective Data-Parallel Load Balancing
Load balancing algorithms improve a program’s performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-effective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallelpolygon...
متن کاملCost-eeective Data-parallel Load Balancing Cost-eeective Data-parallel Load Balancing
Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-eeective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...
متن کاملLine Balancing of Single Model Assembly Line
Line balancing is an effective tool to improve the throughput of assembly line while reducing nonvalue-added activities, cycle time. LB is the problem of assigning operation to workstation along an assembly line, in such a way that assignment is optimal in some sense. This paper mainly focuses on improving overall efficiency of single model assembly line by reducing the non value added activiti...
متن کامل